package algorithm.problems.two_pointers;

/**
 * Created by gouthamvidyapradhan on 04/07/2017.
 * Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
 * <p>
 * Do not allocate extra space for another array, you must do this in place with constant memory.
 * <p>
 * For example,
 * Given input array nums = [1,1,2],
 * <p>
 * Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.
 */
public class RemoveDuplicates {
    public static void main(String[] args) throws Exception {
        int[] nums = {1, 1, 2};
        int N = new RemoveDuplicates().removeDuplicates(nums);
        for (int i = 0; i < N; i++)
            System.out.print(nums[i] + " ");
    }

    public int removeDuplicates(int[] nums) {
        if (nums.length == 1) return 1;
        int size = 1;
        for (int j = 0, i = 1; i < nums.length; i++) {
            if (nums[i] != nums[i - 1]) {
                size++;
                j++;
                nums[j] = nums[i];
            }
        }
        return size;
    }
}
